Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks

We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As example it provides asymptotically optimal brodcast algorithms for some of the generalized de Bruijn and Kautz graphs. We also give an asymptotically optimal gossiping protocol in full duplex model for the shuue-exchange graph.